Reducing The Number of Constraints Needed During Symmetry Breaking During Search
نویسنده
چکیده
منابع مشابه
Dynamic Symmetry Breaking Constraints
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry breaking constraints, then we post this constraint. We illustrate the method with two examples whe...
متن کاملReducing Symmetry in a Combinatorial Design Problem
A combinatorial design problem is considered which can be modelled as a constraint satisfaction problem in several diierent ways. The models all have a large number of symmetries which cause diiculties when searching for solutions. Diierent approaches to reducing the symmetry are discussed: remodelling the problem ; adding constraints to the model at the outset; and adding constraints during se...
متن کاملReducing Symmetry in Matrix Models: SBDS v. Constraints
We discuss diierent methods of reducing symmetry in CSPs where the variables correspond to the cells of a matrix, and both the rows and the columns of the matrix are interchangeable. Two basic approaches are considered: adding symmetry-breaking constraints to the model, and breaking symmetry during search. We also show how the two approaches can be combined in this case. We empirically compare ...
متن کاملBreaking More Composition Symmetries Using Search Heuristics
The pruning power of partial symmetry breaking depends on the given subset of symmetries to break as well as the interactions among symmetry breaking constraints. In the context of Partial Symmetry Breaking During Search (ParSBDS), the search order determines the set of symmetry breaking constraints to add and thus also makes an impact on node and solution pruning. In this paper, we give the fi...
متن کاملSets of Symmetry Breaking Constraints
[Puget, 2004] has shown that if the symmetry in a constraint satisfaction problem acts only on the variables and there is also an allDifferent constraint on the variables, the symmetry can be eliminated by adding a small number of constraints, linear in the number of variables. In this paper, Puget’s procedure for finding a set of symmetrybreaking constraints is extended to find all possible di...
متن کامل